Inapproximability of Maximum Weighted Edge Biclique via Randomized Reduction and Its Applications
نویسنده
چکیده
Given a complete bipartite graph G = (V1, V2, E) where edges take on both positive and negative weights from set S, the maximum weighted edge biclique problem, or S-MWEB for short, asks to find a biclique subgraph whose sum of edge weights is maximized. This problem has various applications in bioinformatics, machine learning and databases and its (in)approximability remains open. In this paper, we show that for a wide range of choices of S, specifically when
منابع مشابه
Inapproximability of Maximum Weighted Edge Biclique and Its Applications
Given a bipartite graph G = (V1, V2, E) where edges take on both positive and negative weights from set S , the maximum weighted edge biclique problem, or S-MWEB for short, asks to find a bipartite subgraph whose sum of edge weights is maximized. This problem has various applications in bioinformatics, machine learning and databases and its (in)approximability remains open. In this paper, we sh...
متن کاملInapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove inapproximability results. We show that they have no polynomial time approximation scheme, unless NP-complete problems can be solved in randomized subexponential time. Furthermore, we show that the same techniques can b...
متن کاملInapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis
The Small Set Expansion Hypothesis (SSEH) is a conjecture which roughly states that it is NPhard to distinguish between a graph with a small set of vertices whose expansion is almost zero and one in which all small sets of vertices have expansion almost one. In this work, we prove conditional inapproximability results for the following graph problems based on this hypothesis: Maximum Edge Bicli...
متن کاملInapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis
The Small Set Expansion Hypothesis is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose (edge) expansion is almost zero and one in which all small subsets of vertices have expansion almost one. In this work, we prove conditional inapproximability results with essentially optimal ratios for the following graph problems based...
متن کاملInapproximability of the Minimum Biclique Edge Partition Problem
For a graph G, a biclique edge partition SBP(G) is a collection of bicliques (complete bipartite subgraphs) Bi such that each edge of G is contained in exactly one Bi. The Minimum Biclique Edge Partition Problem (MBEPP) asks for SBP(G) with the minimum size. In this paper, we show that for arbitrary small > 0, (6053/6052 − )-approximation of MBEPP is NP-hard. key words: biclique, edge partition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0704.0468 شماره
صفحات -
تاریخ انتشار 2007